Optimal Route Assignment at the Bus Hub with Multiple Berths for Minimal Passenger Transfer Distance

Bus hub is characterized with multiple berths, each serving specific bus routes. When routes at different berths share the same stops en route, passengers to shared may rush among these catch newly arriving bus, causing inconvenience and deteriorating service level. Thus, this research attempts optimize route assignment a minimize passenger transfer distance optional berths. The problem modeled integer linear programming, constraints of capacity. To enhance computation efficiency, exclusive inclusive based on count are additionally added original model, though they bring gap from optimal solution. Case study follows apply proposed set models terminal, where total 26 assigned 11 It found that additional can greatly reduce calculation time cost small or no recommended obtain ideal solution quickly. This provides insights into management terminal contributing enhanced waiting experience.